Resource Allocation Using Queuing Theory In A Walk-In Clinic
نویسندگان
چکیده
منابع مشابه
using game theory techniques in self-organizing maps training
شبکه خود سازمانده پرکاربردترین شبکه عصبی برای انجام خوشه بندی و کوانتیزه نمودن برداری است. از زمان معرفی این شبکه تاکنون، از این روش در مسائل مختلف در حوزه های گوناگون استفاده و توسعه ها و بهبودهای متعددی برای آن ارائه شده است. شبکه خودسازمانده از تعدادی سلول برای تخمین تابع توزیع الگوهای ورودی در فضای چندبعدی استفاده می کند. احتمال وجود سلول مرده مشکلی اساسی در الگوریتم شبکه خودسازمانده به حسا...
A Status Report on Resource Allocation in Cloud Computing Using Queuing Theory
Cloud computing has emerged as an optimal way of sharing and providing resources over the internet. Resource Allocation is one of the pretentious concerns in the cloud. It allocates the resources to its consumer on demand. Because it offers dynamic flexible resource allocation for reliable and guaranteed services in pay as-you-use manner to public. In this paper, we surveyed and analyzed severa...
متن کاملRobust Multiclass Queuing Theory for Wait Time Estimation in Resource Allocation Systems
In this paper we study systems that allocate different types of scarce resources to heterogeneous allocatees based on predetermined priority rules, e.g., the U.S. deceased-donor kidney allocation system or the public housing program. We tackle the problem of estimating the wait time of an allocatee who possesses incomplete system information with regard, for example, to his relative priority, o...
متن کاملRobust Multiclass Queuing Theory for Wait Time Estimation in Resource Allocation Systems
In this paper we study systems that allocate different types of scarce resources to heterogeneous allocatees based on predetermined priority rules, e.g., the U.S. deceased-donor kidney allocation system or the public housing program. We tackle the problem of estimating the wait time of an allocatee who possesses incomplete system information with regard, for example, to his relative priority, o...
متن کاملDeveloping a New Bi-Objective Functions Model for a Hierarchical Location-Allocation Problem Using the Queuing Theory and Mathematical Programming
In this research, a hierarchical location-allocation problem is modeled in a queue framework. The queue model is considered as M/M/1/k, in which system capacity is finite, equals to k. This is the main contribution of the current research. Customer's enters to the system in order to find the service according to a Poisson. In this problem, the hierarchical location-allocation model is considere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Health Sciences (AJHS)
سال: 2012
ISSN: 2157-9636,2156-7794
DOI: 10.19030/ajhs.v3i4.7325